Triangulations with Circular Arcs
نویسندگان
چکیده
An important objective in the choice of a triangulation is that the smallest angle becomes as large as possible. In the straight line case, it is known that the Delaunay triangulation is optimal in this respect. We propose and study the concept of a circular arc triangulation— a simple and effective alternative that offers flexibility for additionally enlarging small angles—and discuss its applications in graph drawing.
منابع مشابه
Triangulations with Circular and Parabolic Arcs
In this paper, we expand circular arc triangulations with parabolic arcs, which are triangulations whose edges are circular or parabolic arcs. Creating triangulations this way bears several advantages if angles are to be optimized, especially for finite element method. A typical reason for the occurrence of small angles in a straight line triangulation is that the geometry of the vertex set for...
متن کاملDrawing trees and triangulations with few geometric primitives
We define the visual complexity of a plane graph drawing to be the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g. you need only one line segment to draw two collinear edges of the same vertex). We show that trees can be drawn with 3n/4 straight-line segments on a polynomial grid, and with n/2 straight-line segments on ...
متن کاملA calculus for ideal triangulations of three-manifolds with embedded arcs
Refining the notion of an ideal triangulation of a compact three-manifold, we provide in this paper a combinatorial presentation of the set of pairs (M,α), where M is a three-manifold and α is a collection of properly embedded arcs. We also show that certain well-understood combinatorial moves are sufficient to relate to each other any two refined triangulations representing the same (M,α). Our...
متن کاملColoring Circular Arcs with Applications (extended Abstract)
The circular arc coloring problem is the problem of nding a minimal coloring of a set of arcs on a circle so that if two arcs intersect then they are assigned diierent colors. When a generic set of circular arcs is to be colored, the problem is known to be NP-complete; we consider certain instances of the problem which can be optimally solved in polynomial time. For the class of hereditary fami...
متن کاملComputation of Voronoi Diagrams of Circular Arcs and Straight Lines
Vroni is one of few existing implementations for the stable computation of Voronoi diagrams of line segments. A topology-oriented approach in combination with double-precision floating-point arithmetic makes Vroni also the fastest and most reliable implementation available. Up to now, Voronoi diagram algorithms used in industrial applications process input data consisting of points and straight...
متن کامل